package com.leetcode.trainingDay.training11;


/**
 * 1->5->1 山体
 */
public class training1103 {
    public static void main(String[] args) {
        int[] a={2,5,8,12,19};
        System.out.println("shitutuya:"+validMountainArray(a));
    }
   /* public static  boolean validMountainArray(int[] A) {
        if(A.length==1){
            return false;
        }
        else if(A.length>0){
            int min=A[0];
            int max=A[1];
            if(min > max){
                return false;
            }
            int[] b =new int[A.length+1];
            for(int i=0;i<A.length;i++){
                b[i]=A[i];
            }
            b[A.length] = -1;
            boolean flag=true;
            for(int i=1;i<b.length-1;i++){
                if(flag){
                    if(max<b[i+1]){
                        max=b[i+1];
                    }else{
                        if(i==b.length-2){
                            return false;
                        }
                        flag=false;
                    }
                }
                if(!flag){
                    if(max>b[i+1]){
                        max=b[i+1];
                    }else{
                        return false;
                    }
                }
            }
            return true;
        }
        else{
            return false;
        }*/

    public static  boolean validMountainArray(int[] A){
      return false;
    }
}
